Published in: LIPIcs, Volume 169, 35th Computational Complexity Conference (CCC 2020)
Daniel Dadush and Samarth Tiwari. On the Complexity of Branching Proofs. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 34:1-34:35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dadush_et_al:LIPIcs.CCC.2020.34, author = {Dadush, Daniel and Tiwari, Samarth}, title = {{On the Complexity of Branching Proofs}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {34:1--34:35}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.34}, URN = {urn:nbn:de:0030-drops-125863}, doi = {10.4230/LIPIcs.CCC.2020.34}, annote = {Keywords: Branching Proofs, Cutting Planes, Diophantine Approximation, Integer Programming, Stabbing Planes, Tseitin Formulas} }
Feedback for Dagstuhl Publishing